home
***
CD-ROM
|
disk
|
FTP
|
other
***
search
/
ftp.cs.arizona.edu
/
ftp.cs.arizona.edu.tar
/
ftp.cs.arizona.edu
/
icon
/
newsgrp
/
group93b.txt
/
000115_icon-group-sender _Tue May 18 22:14:18 1993.msg
< prev
next >
Wrap
Internet Message Format
|
1993-06-16
|
2KB
Received: from owl.CS.Arizona.EDU by cheltenham.CS.Arizona.EDU; Wed, 26 May 1993 12:26:52 MST
Received: by owl.cs.arizona.edu; Wed, 26 May 1993 12:26:51 MST
Date: 18 May 93 22:14:18 GMT
From: dog.ee.lbl.gov!overload.lbl.gov!agate!msuinfo!uchinews!ellis!goer@ucbvax.Berkeley.EDU (Richard L. Goerwitz)
Organization: University of Chicago
Subject: Re: seeking parser generator for icon
Message-Id: <1993May18.221418.5749@midway.uchicago.edu>
References: <1993May18.202127.23115@walter.bellcore.com>
Sender: icon-group-request@cs.arizona.edu
To: icon-group@cs.arizona.edu
Status: R
Errors-To: icon-group-errors@cs.arizona.edu
norman@decadent.bellcore.com (Norman Ramsey) writes:
>
>Has anyone implemented a parser generator that emits Icon code and has
>support for semantic actions? yacc-style would be ideal, but anything
>with semantic actions will do. I cooked something up a while back
>that accepts EBNF, but I'm not thrilled about trying to alter it to
>support semantic actions, especially if someone else has already done
>the work :-)
Norman just wrote to me, and I have responded. But in case anyone else
wonders, my recent posting about an Icon-based SLR(1) parser generator
is exactly what he is after, with the one reservation that it uses an
SLR table generation algorithm instead of an LALR one. It takes YACC-
like input, and supports semantic actions, just like Norman wants.
I repeat the offer that, if anyone wants a shell archive of this system,
I'll be glad to mail it out, as long as recipients understand that it is
new, and likely to have bugs.
Unlike the last parser generator I posted (which was LR(1), and little
more than a toy), this one is actually a practical system. For small-to-
medium grammars the resulting parsers clip along well enough for inter-
active use. Processing the grammar can take a while, though, especially
if you turn on table compression.
--
-Richard L. Goerwitz goer%midway@uchicago.bitnet
goer@midway.uchicago.edu rutgers!oddjob!ellis!goer